Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
نویسندگان
چکیده
We introduce a new global constraint which combines together the lexicographic ordering constraint with some sum constraints. Lexicographic ordering constraints are frequently used to break symmetry, whilst sum constraints occur in many problems involving capacity or partitioning. Our results show that this global constraint is useful when there is a very large space to explore, such as when the problem is unsatisfiable, or when the search strategy is poor or conflicts with the symmetry breaking constraints. By studying in detail when combining lexicographical ordering with other constraints is useful, we propose a new heuristic for deciding when to combine constraints together.
منابع مشابه
Global constraints by composition: lexicographic ordering with sums
We introduce a new global constraint which combines together a lexicographic ordering constraint with some sum constraints. Applications for this constraint include balanced incomplete block designs and the ternary Steiner problem. We develop an efficient linear time algorithm for propagating this constraint. This combination of constraints increases the filtering, leading to significant decrea...
متن کاملSix Ways of Integrating Symmetries within Non-overlapping Constraints
This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a chain of lexicographic ordering constraint within a generic geometric constraint kernel, the four latter ...
متن کاملCombining Symmetry Breaking and Global Constraints
We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a general purpose propagator for this family of constraints, and show how to improve its complexity by exploiting properties of the included global constraints.
متن کاملA note on the compatibility of static symmetry breaking constraints and dynamic symmetry breaking methods
Adding static constraints (e.g. lexicographic constraints) and modifying a backtracking search procedure to dynamically eliminate the consideration of symmetrically equivalent states (e.g. SBDS and SBDD) are two common methods for breaking symmetry, with different advantages and disadvantages. It is natural to try to combine these in order to try to harness the strengths of each. However, in so...
متن کاملConfluence of Reduction Rules for Lexicographic Ordering Constraints
The lex leader method for breaking symmetry in CSPs typically produces a large set of lexicographic ordering constraints. Several rules have been proposed to reduce such sets whilst preserving logical equivalence. These reduction rules are not generally confluent: they may reach more than one fixpoint, depending on the order of application. These fixpoints vary in size. Smaller sets of lex cons...
متن کامل